Smaller representation of finite state automata
نویسندگان
چکیده
منابع مشابه
Smaller Representation of Finite State Automata
This paper is a follow-up to Jan Daciuk’s experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory [4]. We investigate several techniques of reducing the memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for ...
متن کاملRepresentation of Finite State Automata
In this paper, we propose some techniques for injecting nite state automata into Recurrent Radial Basis Function networks (R 2 BF). When providing proper hints and constraining the weight space properly, we show that these networks behave as automata. A technique is suggested for forcing the learning process to develop automata representations that is based on adding a proper penalty function t...
متن کاملImage Representation Using Finite State Automata
Image representation using quadtrees is useful in many applications and is well known in computer graphics. It has been shown that we can represent quadtrees asrationallanguages that are recognizable by finite state automata (FSA) [1]. These FSA can use less memory and are more flexible than their corresponding quadtrees. Binary image representation using FSA follows these two main steps: (1) F...
متن کاملComparing Finite State Automata Representation with GP-trees
Genetic Programming and Evolutionary Programming are fields studying the application of artificial evolution on evolving directly executable programs, in form of trees similar to Lisp expressions (GP-trees), or Finite State Automata (FSA). In this exercise, we study the performance of these methods on several example problems, and draw conclusions on the suitability of the representations with ...
متن کاملFinite State Automata – a concept for data representation
In this paper, we introduce finite automata as a tool for matrix specification and compression. We also describe, how to get additional interesting information from such automata. At last, we focus on techniques for storing resultant automata as matrices, tables of an SQL database, or as XML document.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.04.023